Bound Variables and C‐Command
نویسندگان
چکیده
It has long been assumed in linguistics that bound variable interpretations of pronouns are possible (only) when a quantified expression c-commands the pronoun. In two studies in which readers’ eye movements were recorded, we examined the processing of pronouns bound by universal quantifiers. Experiment 1 compared examples where the quantifier c-commands the pronoun (‘Every British soldier thought he killed an enemy soldier’) with examples where it doesn’t (‘Every British soldier aimed and then he killed an enemy soldier’). Although there were no first pass differences, re-reading time showed that both quantifier examples took longer to read than nonquantified controls (‘The old British soldier. . . ’), but there was no special penalty in examples when the quantifier failed to c-command the pronoun. Experiment 2 investigated intersentential binding (telescoping): ‘John Frederick/Each executive/Every executive went home. He broiled a steak. He ate dinner. Then he watched television.’ Second pass and total reading times in the region containing the first pronoun were longer for quantified examples than name examples. But there was no indication that telescoping is tightly restricted, for example, to contexts with ‘each’ or to discourses describing stereotypical events composed of predictable subevents. The results suggest that bound variable interpretations are more generally and more readily available than is often assumed. They fit well with Bosch’s (1983) attempt to limit pronoun occurrences to just two types: anaphoric referential pronouns and syntactic agreement pronouns. On this view, ‘bound variable’ interpretations without c-command are really anaphoric pronouns with inferred antecedents. This view is discussed along with the challenges it faces.
منابع مشابه
A Tail Bound for Read-k Families of Functions
We prove a Chernoff-like large deviation bound on the sum of non-independent random variables that have the following dependence structure. The variables Y1, . . . , Yr are arbitrary Boolean functions of independent random variables X1, . . . , Xm, modulo a restriction that every Xi influences at most k of the variables Y1, . . . , Yr.
متن کاملIranian Tourism Demand for Malaysia: A Bound Test Approach
This paper investigate Iranian tourism demand to Malaysia using the recently developed autoregressive distributed lag (ARDL) ‘Bound test’ approach to cointegration for 2000:Q1 to 2013:Q4. The demand for tourism has been explained by macroeconomic variables, including income in Iran, tourism prices in Malaysia, tourism price substitute, travel cost and trade value between Iran and Malaysia. In a...
متن کاملThe Empirical Analysis of Monetary Policy on Balance of Payments Adjustments in Nigeria: A Bound Testing Approach
This study investigates the impact of monetary policy on balance of payments (BOP) adjustment in Nigeria within the periods, 1980-2015. The study used the bound testing approach to show the relationship that exists among monetary policy variables (money supply, domestic credit, inflation and exchange rate), output growth, and trade balance and BOP adjustment in Nigeria. The study shows that the...
متن کاملA bound for Feichtinger conjecture
In this paper, using the discrete Fourier transform in the finite-dimensional Hilbert space C^n, a class of nonRieszable equal norm tight frames is introduced and using this class, a bound for Fiechtinger Conjecture is presented. By the Fiechtinger Conjecture that has been proved recently, for given A,C>0 there exists a universal constant delta>0 independent of $n$ such that every C-equal...
متن کاملRelation-sensitive retrieval: Evidence from bound variable pronouns
Formal grammatical theories make extensive use of syntactic relations (e.g. c-command, Reinhart, 1983) in the description of constraints on antecedent-anaphor dependencies. Recent research has motivated a model of processing that exploits a cue-based retrieval mechanism in content-addressable memory (e.g. Lewis, Vasishth, & Van Dyke, 2006) in which item-to-item syntactic relations such as c-com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Semantics
دوره 19 شماره
صفحات -
تاریخ انتشار 2002